ASHACL: Alternative Shapes Constraint Language

نویسنده

  • Peter F. Patel-Schneider
چکیده

ASHACL, a variant of the W3C Shapes Constraint Language, is designed to determine whether an RDF graph meets some conditions. These conditions are grouped into shapes, which validate whether particular RDF terms each meet the constraints of the shape. Shapes are themselves expressed as RDF triples in an RDF graph, called a shapes graph.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Modelling Search Strategies in Rules2CP

In this abstract, we present a rule-based modelling language for constraint programming, called Rules2CP [1], and a library PKML for modelling packing problems. Unlike other modelling languages, Rules2CP adopts a single knowledge representation paradigm based on logical rules without recursion, and a restricted set of data structures based on records and enumerated lists given with iterators. W...

متن کامل

The Rules of Constraint Modelling

Many and diverse combinatorial problems have been solved successfully using finite-domain constraint programming. However, to apply constraint programming to a particular domain, the problem must first be modelled as a constraint satisfaction or optimisation problem. Since constraints provide a rich language, typically many alternative models exist. Formulating a good model therefore requires a...

متن کامل

Modelling and Reformulating Constraint Satisfaction Problems: Towards Systematisation and Automation

Many and diverse search problems have been solved with great success using constraint programming. However, in order to apply constraint programming tools to a particular domain, the problem must be modelled as a constraint satisfaction or optimisation problem. Since constraints provide a rich language, typically many alternative models exist. Formulating a good model therefore requires a great...

متن کامل

A Stochastic Continuous Optimization Backend for MiniZinc with Applications to Geometrical Placement Problems

MiniZinc is a solver-independent constraint modeling language which is increasingly used in the constraint programming community. It can be used to compare different solvers which are currently based on either Constraint Programming, Boolean satisfiability, Mixed Integer Linear Programming, and recently Local Search. In this paper we present a stochastic continuous optimization backend for Mini...

متن کامل

The Rules of Constraint Modelling: An Overview

We address a major bottleneck in the use of constraint programming: modelling. Our system CONJURE automatically refines a specification of a problem in our abstract constraint specification language, ESSENCE, into a set of alternative constraint programs, thus automating an important part of the modelling process and helping to reduce the modelling bottleneck significantly.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • CoRR

دوره abs/1702.01795  شماره 

صفحات  -

تاریخ انتشار 2017